Asymptotically optimal parallel resource assignment with interference
نویسندگان
چکیده
منابع مشابه
Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in cellular wireless networks and resource allocation in computer systems, we study a service facility with two classes of users having heterogeneous service requirement distributions. The aggregate service capacity is assumed to be largest when both classes are served in parallel, but giving preferential treatment to one of the classes may be advantageous when aiming at...
متن کاملUvA - DARE ( Digital Academic Repository ) Asymptotically optimal parallel resource assignment with interference
Motivated by scheduling in multi-cell wireless networks and resource allocation in computer systems, we study a service facility with two types of users (or jobs) having heterogeneous size distributions. Our model may be viewed as a parallel two-server model, where either both job types can be served in parallel, each by a dedicated server, or both servers are simultaneously allocated to one ty...
متن کاملAsymptotically Optimal Resource Block Allocation With Limited Feedback
Consider a channel allocation problem over a frequency-selective channel. There are K channels (frequency bands) and N users such that K = bN for some positive integer b. We want to allocate b channels (or resource blocks) to each user. Due to the nature of the frequency-selective channel, each user considers some channels to be better than others. Allocating each user only good channels will r...
متن کاملOptimal Resource Assignment in Internet Data Centers
This paper presents a resource model that describes the computing and networking components in a resource sharing environment in an Internet Data Center (IDC), a model for multi-tier applications that need to be deployed in this environment, and an optimization problem for resource assignment aimed at minimizing the communication delay between the servers. A number of techniques are introduced ...
متن کاملOptimal Processor Assignment for Parallel Database Design
The computing time beneets of parallelism in database systems (achieved by using multiple processors to execute a query) must be weighed against communication, startup, and termination overhead costs that increase as a function of the number of processors used. We consider problems of minimizing overhead subject to allocating data among the processors according to speciied loads. We present low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2010
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-010-9171-4